empty queue

См. также в других словарях:

• Queue (data structure) — A queue (pronounced /kjuː/) is a particular kind of collection in which the entities in the collection are kept in order and the principal (or only) operations on the collection are the addition of entities to the rear terminal position and… …   Wikipedia

• Double-ended priority queue — Not to be confused with Double ended queue. A double ended priority queue (DEPQ)[1] is an abstract data type similar to a priority queue except that it allows for efficient removal of both the maximum and minimum element. It is a data structure… …   Wikipedia

• Priority queue — A priority queue is an abstract data type in computer programming. It is exactly like a regular queue or stack data structure, but additionally, each element is associated with a priority . stack: elements are pulled in last in first out order (e …   Wikipedia

• Double-ended queue — Not to be confused with Double ended priority queue. In computer science, a double ended queue (dequeue, often abbreviated to deque, pronounced deck) is an abstract data structure that implements a queue for which elements can only be added to or …   Wikipedia

• Blue (queue management algorithm) — Blue [W. Feng, D. Kandlur, D. Saha, K. Shin. Blue: A New Class of Active Queue Management Algorithms. U. Michigan CSE TR 387 99, April 1999.] is an Active Queue Management algorithm. Like RED, it operates by randomly dropping or ECN marking… …   Wikipedia

• Fluid queue — In probability theory, a fluid queue is a mathematical model used to describe the fluid level in a reservoir subject to randomly determined periods of filling and emptying. The term dam theory was used in earlier literature for these models. The… …   Wikipedia

• Standard ML — Infobox programming language name = Standard ML logo = paradigm = multi paradigm: functional, imperative year = designer = typing = strong, static, inferred dialects = Alice, Dependent ML implementations = MLton, MLWorks, Moscow ML, Poly/ML,… …   Wikipedia

• Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional …   Wikipedia

• Flood fill — Flood fill, also called seed fill, is an algorithm that determines the area connected to a given node in a multi dimensional array. It is used in the bucket fill tool of paint programs to determine which parts of a bitmap to fill with color, and… …   Wikipedia

• Continuation — For other uses, see Continuation (disambiguation). In computer science and programming, a continuation is an abstract representation of the control state of a computer program. A continuation reifies the program control state, i.e. the… …   Wikipedia

• Deficit round robin — DWRR redirects here. For the radio station in Philippines, see DWRR FM. Deficit round robin (DRR),[1] also deficit weighted round robin (DWRR), is a modified weighted round robin scheduling discipline. DRR was proposed by M. Shreedhar and G.… …   Wikipedia